Propositional Dynamic Logic for Message-Passing Systems
نویسندگان
چکیده
منابع مشابه
Propositional Dynamic Logic for Message-Passing Systems
We examine a bidirectional Propositional Dynamic Logic (PDL) for finite and infinite message sequence charts (MSCs) extending LTL and TLC−. By this kind of multimodal logic we can express properties both in the entire future and in the past of an event. Path expressions strengthen the classical until operator of temporal logic. For every formula defining an MSC language, we construct a communic...
متن کاملPropositional Dynamic Logic with Converse and Repeat for Message-Passing Systems
The model checking problem for propositional dynamic logic (PDL) over message sequence charts (MSCs) and communicating finite state machines (CFMs) asks, given a channel bound B, a PDL formula φ and a CFM C, whether every existentially B-bounded MSC M accepted by C satisfies φ. Recently, it was shown that this problem is PSPACEcomplete. In the present work, we consider CRPDL over MSCs which is ...
متن کاملMessage Passing Logic
Message passing is a key ingredient of concurrent programming. The purpose of this paper is to describe the equivalence between the proof theory, the categorical semantics, and term calculus of message passing. In order to achieve this we introduce the categorical notion of a linear actegory and the related polycategorical notion of a poly-actegory. Not surprisingly the notation used for the te...
متن کاملThe logic of message passing
Message passing is a key ingredient of concurrent programming. The purpose of this paper is to describe the equivalence between the proof theory, the categorical semantics, and term calculus of message passing. In order to achieve this we introduce the categorical notion of a linear actegory and the related polycategorical notion of a poly-actegory. Not surprisingly the notation used for the te...
متن کاملMessage Passing for Dynamic Network Energy Management
We consider a network of devices, such as generators, fixed loads, deferrable loads, and storage devices, each with its own dynamic constraints and objective, connected by lossy capacitated lines. The problem is to minimize the total network objective subject to the device and line constraints, over a given time horizon. This is a large optimization problem, with variables for consumption or ge...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logical Methods in Computer Science
سال: 2010
ISSN: 1860-5974
DOI: 10.2168/lmcs-6(3:16)2010